Probabilistic Reachability for Stochastic Hybrid Systems: Theory, Computations, and Applications
نویسندگان
چکیده
Probabilistic Reachability for Stochastic Hybrid Systems: Theory, Computations, and Applications by Alessandro Abate Doctor of Philosophy in Electrical Engineering and Computer Sciences University of California, Berkeley Professor Shankar S. Sastry, Chair Stochastic Hybrid Systems are probabilistic models suitable at describing the dynamics of variables presenting interleaved and interacting continuous and discrete components. Engineering systems like communication networks or automotive and air traffic control systems, financial and industrial processes like market and manufacturing models, and natural systems like biological and ecological environments exhibit compound behaviors arising from the compositions and interactions between their heterogeneous components. Hybrid Systems are mathematical models that are by definition suitable to describe such complex systems. The effect of the uncertainty upon the involved discrete and continuous dynamics—both endogenously and exogenously to the system—is virtually unquestionable for biological systems and often inevitable for engineering systems, and naturally leads to the employment of stochastic hybrid models. The first part of this dissertation introduces gradually the modeling framework and focuses on some of its features. In particular, two sequential approximation procedures are introduced, which translate a general stochastic hybrid framework into a new probabilistic model. Their convergence properties are sketched. It is argued that the obtained model is more predisposed to analysis and computations. The kernel of the thesis concentrates on understanding the theoretical and computational issues associated with an original notion of probabilistic reachability for
منابع مشابه
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symbolic technique for computing reachability probabilities in probabilistic hybrid systems. Motivated by the fact that several industrial applications call for quantitative measures that go beyond mere reachability probabiliti...
متن کاملStochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
The analysis of hybrid systems exhibiting probabilistic behaviour is notoriously difficult. To enable mechanised analysis of such systems, we extend the reasoning power of arithmetic satisfiability-modulo-theory solving (SMT) by a comprehensive treatment of randomized (a.k.a. stochastic) quantification over discrete variables within the mixed Boolean-arithmetic constraint system. This provides ...
متن کاملProbabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of the reachability problem in a stochastic control framework reveals that it is amenable to two complementary interpretations, leading to dual algorithms for reachability computations. In particular, the set of initial c...
متن کاملConstraint-Based Analysis of Concurrent Probabilistic Hybrid Systems: An Application to Networked Automation Systems
In previous publications, the authors have introduced the notion of stochastic satisfiability modulo theories (SSMT) and the corresponding SiSAT solving algorithm, which provide a symbolic method for the reachability analysis of probabilistic hybrid systems. SSMT extends satisfiability modulo theories (SMT) with randomized (or stochastic), existential, and universal quantification, as known fro...
متن کاملSReach: A Probabilistic Bounded δ-Reachability Analyzer for Stochastic Hybrid Systems
In this paper, we present a new tool SReach, which solves probabilistic bounded reachability problems for two classes of models of stochastic hybrid systems. The first one is (nonlinear) hybrid automata with parametric uncertainty. The second one is probabilistic hybrid automata with additional randomness for both transition probabilities and variable resets. Standard approaches to reachability...
متن کامل